Core problems in bi-criteria {0, 1}-knapsack problemsDA SILVA, Carlos Gomes; CLIMACO, Joao; FIGUEIRA, Jose Rui et al.Computers & operations research. 2008, Vol 35, Num 7, pp 2292-2306, issn 0305-0548, 15 p.Article

A polyhedral study of the cardinality constrained knapsack problemDE FARIAS, I. R; NEMHAUSER, G. L.Mathematical programming. 2003, Vol 96, Num 3, pp 439-467, issn 0025-5610, 29 p.Article

The average behaviour of greedy algorithms for the knapsack problem: General distributionsDIUBIN, Gennady; KORBUT, Alexander.Mathematical methods of operations research (Heidelberg). 2003, Vol 57, Num 3, pp 449-479, issn 1432-2994, 31 p.Article

Sensitivity analysis of the knapsack sharing problem : Perturbation of the weight of an itemBELGACEM, T; HIFI, M.Computers & operations research. 2008, Vol 35, Num 1, pp 295-308, issn 0305-0548, 14 p.Article

An optimization algorithm for a penalized knapsack problemCESELLI, Alberto; RIGHINI, Giovanni.Operations research letters. 2006, Vol 34, Num 4, pp 394-404, issn 0167-6377, 11 p.Article

A constructive periodicity bound for the unbounded knapsack problemHUANG, Ping H; TANG, Kwei.Operations research letters. 2012, Vol 40, Num 5, pp 329-331, issn 0167-6377, 3 p.Article

An exact algorithm for the knapsack sharing problem with common itemsFUJIMOTO, Masako; YAMADA, Takeo.European journal of operational research. 2006, Vol 171, Num 2, pp 693-707, issn 0377-2217, 15 p.Article

An improved branch and bound algorithm for a strongly correlated unbounded knapsack problemSEONG, Y-J; G, Y-G; KANG, M-K et al.The Journal of the Operational Research Society. 2004, Vol 55, Num 5, pp 547-552, issn 0160-5682, 6 p.Article

Improved dynamic programming in connection with an FPTAS for the knapsack problemKELLERER, Hans; PFERSCHY, Ulrich.Journal of combinatorial optimization. 2004, Vol 8, Num 1, pp 5-11, issn 1382-6905, 7 p.Article

The one dimensional Compartmentalised Knapsack Problem : A case study : Cutting and PackingHOTO, Robinson; ARENALES, Marcos; MACULAN, Nelson et al.European journal of operational research. 2007, Vol 183, Num 3, pp 1183-1195, issn 0377-2217, 13 p.Article

La Réduction des Réseaux en Crytographie = Lattice reduction in CryptographyJoux, Antoine; Stern, Jacques.1993, 82 p.Thesis

Solving the knapsack problem with imprecise weight coefficients using genetic algorithmsLIN, Feng-Tse.European journal of operational research. 2008, Vol 185, Num 1, pp 133-145, issn 0377-2217, 13 p.Article

Sacs à ods orthogonaux et sacs à dos divisibles = Orthogonal and divisible knapsacksHARARI, S.TS. Traitement du signal. 1992, Vol 9, Num 3, pp 273-279, issn 0765-0019Article

Approximating the Orthogonal Knapsack Problem for HypercubesHARREN, Rolf.Lecture notes in computer science. 2006, pp 238-249, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Removable online knapsack problemsIWAMA, Kazuo; TAKETOMI, Shiro.Lecture notes in computer science. 2002, pp 293-305, issn 0302-9743, isbn 3-540-43864-5, 13 p.Conference Paper

The use of duality to improve the efficiency of methods of solving the quadratic knapsack problemKISELEV, V. D; SUKMANOV, S. A.Computational mathematics and mathematical physics. 1993, Vol 33, Num 2, pp 287-288, issn 0965-5425Article

Satisfiability problem and lattice basis problem = Problème de satisfaisabilité et problème de réseauxHusain, Dhiaiddin; Morel, H.1996, 88 p.Thesis

Sensitivity analysis for knapsack problems : a negative resultBLAIR, C.Discrete applied mathematics. 1998, Vol 81, Num 1-3, pp 133-139, issn 0166-218XArticle

Tight bounds for periodicity theorems on the unbounded Knapsack problemHUANG, Ping H; LAWLEY, Mark; MORIN, Thomas et al.European journal of operational research. 2011, Vol 215, Num 2, pp 319-324, issn 0377-2217, 6 p.Article

An efficient parallel algorithm for solving the Knapsack problem on hypercubesGOLDMAN, A; TRYSTRAM, D.Journal of parallel and distributed computing (Print). 2004, Vol 64, Num 11, pp 1213-1222, issn 0743-7315, 10 p.Article

Extending Dantzig's bound to the bounded multiple-class binary Knapsack problemVANDERBECK, Francois.Mathematical programming. 2002, Vol 94, Num 1, pp 125-136, issn 0025-5610, 12 p.Article

Optimal Disk Storage Allocation for Multitier Storage SystemHAIXIANG SHI; RAJESH VELLORE ARUMUGAM; CHUAN HENG FOH et al.IEEE transactions on magnetics. 2013, Vol 49, Num 6, pp 2603-2609, issn 0018-9464, 7 p., 1Conference Paper

A least wasted first heuristic algorithm for the rectangular packing problemLIJUN WEI; DEFU ZHANG; QINGSHAN CHEN et al.Computers & operations research. 2009, Vol 36, Num 5, pp 1608-1614, issn 0305-0548, 7 p.Article

An optimization model for Web content adaptationJAN, Rong-Hong; LIN, Ching-Peng; CHERN, Maw-Sheng et al.Computer networks (1999). 2006, Vol 50, Num 7, pp 953-965, issn 1389-1286, 13 p.Article

An experimental study of random knapsack problemsBEIER, Rene; VÖCKING, Berthold.Algorithmica. 2006, Vol 45, Num 1, pp 121-136, issn 0178-4617, 16 p.Conference Paper